Frontal face authentication using morphological elastic graph matching
نویسندگان
چکیده
A novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for frontal face authentication. Instead of a set of Gabor filters tuned to different orientations and scales, multiscale morphological operations are employed to yield a feature vector at each node of the reference grid. Linear projection algorithms for feature selection and automatic weighting of the nodes according to their discriminatory power succeed to increase the authentication capability of the method. The performance of the morphological dynamic link architecture is evaluated in terms of the receiver operating characteristic in the M2VTS face image database. The comparison with other frontal face authentication algorithms indicates that the morphological dynamic link architecture with discriminatory power coefficients is the best algorithm with respect to the equal error rate achieved.
منابع مشابه
Morphological elastic graph matching applied to frontal face authentication under well-controlled and real conditions
In this paper, morphological elastic graph matching is applied to frontal face authentication on databases ranging from small to large multimedia ones collected under either well-controlled or real-world conditions. It is shown that the morphological elastic graph matching achieves a very low equal error rate on databases collected under well-controlled conditions. However, its performance dete...
متن کاملFrontal face authentication using discriminating
A novel elastic graph matching procedure based on multiscale morphological operations, the so called morphological dynamic link architecture, is developed for frontal face authentication. Fast algorithms for implementing mathematical morphology operations are presented. Feature selection by employing linear projection algorithms is proposed. Discriminatory power coeecients that weigh the matchi...
متن کاملFrontal Face Authentication using Variants of Dynamic Link Matching Based on Mathematical Morphology
Two variants of dynamic link matching based on mathematical morphology are developed and tested for frontal face authentication, namely, the Morphological Dynamic Link Architecture and the Morphological Signal Decomposition-Dynamic Link Architecture. Local coeecients which weigh the contribution of each node in elastic graph matching according to its discriminatory power are derived. The perfor...
متن کاملMorphological Elastic Graph Matching applied to frontal face authentication under optimal and real c - Multimedia Computing and Systems, 1999. IEEE International Conference on
In this papel; morphological elastic graph matching is applied to frontal face authentication on databases collected either under optimal conditions or during real-world tests (i.e., access-control to buildings or tele-services via INTERNET in a typical office environment etc.). It is demonstrated that the morphological elastic graph matching achieves a very low equal error rate on databases co...
متن کاملMorphological Elastic Graph Matching Applied to Frontal Face Authentication under Optimal and Real Conditions
In this paper, morphological elastic graph matching is applied to frontal face authentication on databases collected either under optimal conditions or during real-world tests (i.e., access-control to buildings or tele-services via INTERNET in a typical office environment etc.). It is demonstrated that the morphological elastic graph matching achieves a very low equal error rate on databases co...
متن کاملFrontal Face Authentication Using Morphological Elastic Graph Matching This Work Was Carried out within the Framework of European Union Acts Research Project (ac-102) \multi- Modal Veriication Techniques for Tele-services and Security Applications" (m2vts)
A novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for frontal face authentication. Instead of a set of Gabor lters tuned to diierent orientations and scales, mul-tiscale morphological operations are employed to yield a feature vector at each node of the reference grid. Linear projection algorithms for feature selection and automatic weighting of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
دوره 9 4 شماره
صفحات -
تاریخ انتشار 2000